A Diagnosis Algorithm on the Star Graph under the PMC Model
نویسندگان
چکیده
In this paper, we propose a specific structure in the star graph for local diagnosis under the PMC model. We design an adaptive local diagnosis algorithm for a star graph Sn. We prove that Sn is (n − 1)-diagnosable with our proposed algorithm under the PMC model. Moreover, with our algorithm, a diagnosis is completed in three test rounds.
منابع مشابه
Local Diagnosability under the PMC Diagnosis Model with Application to Star Graphs
In this paper, we introduce a new measure of diagnosability, called local diagnosability, and provide a substructure for determining if a node is locally t-diagnosable under the PMC model. We prove that the local diagnosability of the star graph at each node is equal to its degree. Then, we propose a concept called strong local diagnosability property. We show that an n-dimensional star graph S...
متن کاملA diagnosis algorithm by using graph-coloring under the PMC model
Fault diagnosis is important to the design and maintenance of large multiprocessor systems. PMCmodel is themostwell known andwidely studiedmodel in the system level diagnosis of multiprocessor systems. Under the PMCmodel, a diagnosis algorithm based on some graph-coloring techniques has been proposed in this paper. Given a syndrome σ , the first part of the algorithm can locate all the definite...
متن کاملTwo-stage stochastic programming model for capacitated complete star p-hub network with different fare classes of customers
In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...
متن کاملThe Nature Diagnosability of Bubble - sort Star Graphs under the PMC Model and MM * Model
55 www.ijeas.org Abstract—Many multiprocessor systems have interconnection networks as underlying topologies and an interconnection network is usually represented by a graph where nodes represent processors and links represent communication links between processors. No fault set can contain all the neighbors of any fault-free vertex in the system, which is called the nature diagnosability of ...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کامل